<HTML><HEAD><TITLE>graph_is_bidirected(+Graph)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_is_bidirected(+Graph)</H1>
Tests whether a graph is bidirected
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
</DL>
<H2>Description</H2>
<P>
    A graph is bidirected if for every edge from S to T there is a
    corresponding edge from T to S. In case of loops (i.e. an edge
    from S to S) a second, different edge from S to S is required
    to satisfy the bidirectedness condition.
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>graph_is_bidirected(+) is semidet
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/make_undirected_graph-2.html">make_undirected_graph / 2</A>
</BODY></HTML>
